TRIANGLES CAPTURING MANY LATTICE POINTS
نویسندگان
چکیده
منابع مشابه
FINITELY MANY SMOOTH d-POLYTOPES WITH n LATTICE POINTS
We prove that for fixed n there are only finitely many embeddings of Qfactorial toric varieties X into P that are induced by a complete linear system. The proof is based on a combinatorial result that implies that for fixed nonnegative integers d and n, there are only finitely many smooth d-polytopes with n lattice points. We also enumerate all smooth 3-polytopes with ≤ 12 lattice points.
متن کاملOctahedrons with equally many lattice points and generalizations
While counting lattice points in octahedra of different dimensions n and m, it is an interesting question to ask, how many octahedra exist containing equally many such points. This gives rise to the Diophantine equation Pn(x) = Pm(y) in rational integers x, y, where {Pk(x)} denote special Meixner polynomials {M (β,c) k (x)} with β = 1, c = −1. We join the purely algebraic criterion of Y. Bilu a...
متن کاملA Point in Many Triangles
We give a simpler proof of the result of Boros and Füredi that for any finite set of points in the plane in general position there is a point lying in 2/9 of all the triangles determined by these points. Introduction Every set P of n points in R in general position determines ( n d+1 ) d-simplices. Let p be another point in R. Let C(P, p) be the number of the simplices containing p. Boros and F...
متن کاملWeak Matching Points with Triangles
In this paper, we study the weak point matching problem for a given set of n points and a class of equilateral triangles. The problem is to find the maximum cardinality matching of the points using equilateral triangles such that each triangle contains exactly two points and each point lies at most in one triangle. Under the non-degeneracy assumption, we present an O(n) time algorithm using the...
متن کاملTiling Polygons with Lattice Triangles
Given a simple polygon with rational coordinates having one vertex at the origin and an adjacent vertex on the x-axis, we look at the problem of the location of the vertices for a tiling of the polygon using lattice triangles (i.e., triangles which are congruent to a triangle with the coordinates of the vertices being integer). We show that the coordinate of the vertices in any tiling are ratio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 2018
ISSN: 0025-5793,2041-7942
DOI: 10.1112/s0025579318000219